- clip polygon
- отсекающий многоугольник
Англо-русский словарь промышленной и научной лексики. 2014.
Англо-русский словарь промышленной и научной лексики. 2014.
GPC General Polygon Clipper Library — The University of Manchester GPC library is a software library providing an API for computing the results of clipping operations on sets of polygons. It generalises the computer graphics clipping problem of intersecting polygons with polygons.The … Wikipedia
Sutherland-Hodgman clipping algorithm — The Sutherland Hodgman algorithm is used for clipping polygons. It works by extending each line of the clip polygon in turn and selecting only vertices from the subject polygon that are on the visible side.DescriptionBegin with a set of all… … Wikipedia
Weiler-Atherton clipping algorithm — used in computer graphics.It allows clipping of a subject polygon by an arbitrarily shaped clip polygon . It is generally applicable only in 2D. Description The algorithm requires polygons to be clockwise and not reentrant (self intersecting).… … Wikipedia
Atari Jaguar II — Infobox CVG system title = Atari Jaguar II manufacturer = Atari Corporation type = Video game console generation = lifespan = prototype in 1995 CPU = media = onlineservice = topgame = compatibility = Atari Jaguar, Jaguar CD predecessor = Atari… … Wikipedia
OpenGL ES — Original author(s) Khronos Group Developer(s) Khronos Group … Wikipedia
Geographic information system — GIS redirects here. For other uses, see GIS (disambiguation). A geographic information system, geographical information science, or geospatial information studies is a system designed to capture, store, manipulate, analyze, manage, and present… … Wikipedia
Z-fighting — is a phenomenon in 3D rendering that occurs when two or more primitives have similar values in the z buffer, and is particularly prevalent with coplanar polygons. The effect causes pseudo random pixels to be rendered with the color of one polygon … Wikipedia
Sutherland-Hodgeman — Der Algorithmus von Sutherland Hodgman ist ein Algorithmus der Computergrafik zum Clipping von Polygonen. Inhaltsverzeichnis 1 Grundversion 2 Erweiterte Version 3 Literatur 4 Weblinks … Deutsch Wikipedia
Sutherland Hodgman — Der Algorithmus von Sutherland Hodgman ist ein Algorithmus der Computergrafik zum Clipping von Polygonen. Inhaltsverzeichnis 1 Grundversion 2 Erweiterte Version 3 Literatur 4 Weblinks … Deutsch Wikipedia
Clipping (Computergrafik) — Als Clipping oder Abschneiden (englisch to clip = „abschneiden“, „kappen“) bezeichnet man in der Computergrafik das Abschneiden von Grundobjekten am Rand eines gewünschten Bildschirmausschnittes oder Fensters. Ein Fenster kann dabei ein… … Deutsch Wikipedia
Sega Saturn — Sega Saturn … Wikipedia